Minimizing Total Variation Flow
نویسنده
چکیده
We prove existence and uniqueness of weak solutions for the minimizing Total Variation ow with initial data in L1. We prove that the length of the level sets of the solution, i.e., the boundaries of the level sets, decreases with time, as one would expect, and the solution converges to the spatial average of the initial datum as t ! 1. We also prove that local maxima strictly decrease with time, in particular, at zones immediately decrease their level. We display some numerical experiments illustrating these facts.
منابع مشابه
A New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm
This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...
متن کاملParticle swarm optimization for minimizing total earliness/tardiness costs of two-stage assembly flowshop scheduling problem in a batched delivery system
This paper considers a two-stage assembly flow shop scheduling problem. When all parts of each product are completed in the first stage, they are assembled into a final product on an assembly machine in the second stage. In order to reduce the delivery cost, completed products can be held until completion of some other products to be delivered in a same batch. The proposed problem addresses sch...
متن کاملMinimizing the energy consumption and the total weighted tardiness for the flexible flowshop using NSGA-II and NRGA
This paper presents a bi-objective MIP model for the flexible flow shop scheduling problem (FFSP) in which the total weighted tardiness and the energy consumption are minimized simultaneously. In addition to considering unrelated machines at each stage, the set-up times are supposed to be sequence- and machine-dependent, and it is assumed that jobs have different release tim...
متن کاملA Double Pipe Heat Exchanger Design and Optimization for Cooling an Alkaline Fuel Cell System
In the presented research, heat transfer of a mobile electrolyte alkaline fuel cell (AFC) (which the electrolyte has cooling role of system) has been considered. Proper control volumes of system with specific qualification have been chosen. Consequently, heat and mass transfer in control volumes have been assessed. Considerations on them and contributed models lead to approve a double tube heat...
متن کامل